Control of Inventories under Non-Convex Polynomial Cost Functions
نویسندگان
چکیده
We propose an alternative method for computing e¤ectively the solution of the control inventory problem under non-convex polynomial cost functions. We apply the method of moments in global optimization to transform the corresponding, non-convex dynamic programming problem into an equivalent optimal control problem with linear and convex structure. We device computational tools based on convex optimization, to solve the convex formulation of the original problem.
منابع مشابه
Inequalities of Ando's Type for $n$-convex Functions
By utilizing different scalar equalities obtained via Hermite's interpolating polynomial, we will obtain lower and upper bounds for the difference in Ando's inequality and in the Edmundson-Lah-Ribariv c inequality for solidarities that hold for a class of $n$-convex functions. As an application, main results are applied to some operator means and relative operator entropy.
متن کاملOptimality and Duality for an Efficient Solution of Multiobjective Nonlinear Fractional Programming Problem Involving Semilocally Convex Functions
In this paper, the problem under consideration is multiobjective non-linear fractional programming problem involving semilocally convex and related functions. We have discussed the interrelation between the solution sets involving properly efficient solutions of multiobjective fractional programming and corresponding scalar fractional programming problem. Necessary and sufficient optimality...
متن کاملA Semidefinite Optimization Approach to Quadratic Fractional Optimization with a Strictly Convex Quadratic Constraint
In this paper we consider a fractional optimization problem that minimizes the ratio of two quadratic functions subject to a strictly convex quadratic constraint. First using the extension of Charnes-Cooper transformation, an equivalent homogenized quadratic reformulation of the problem is given. Then we show that under certain assumptions, it can be solved to global optimality using semidefini...
متن کاملAn Ergodic Control Problem for Many-server Multi-class Queueing Systems with Help
AM/M/N +M queueing network is considered with d independent customer classes and d server pools in Halfin-Whitt regime. Class i customers has priority for service in pool i for i = 1, . . . , d, and may access other pool if the pool has an idle server. We formulate an ergodic control problem where the running cost is given by a non-negative convex function with polynomial growth. We show that t...
متن کاملAn Ergodic Control Problem for Many-server Multi-class Queuing Systems with Help
A M/M/N +M queuing network is considered with d independent customer classes and d server pools in Halfin-Whitt regime. Class i customers have priority for service in pool i for i = 1, . . . , d, and may access other pool if the pool has an idle server. We formulate an ergodic control problem where the running cost is given by a non-negative convex function with polynomial growth. We show that ...
متن کامل